FPGA and ASIC implementations of the etaT pairing in characteristic three

نویسندگان

  • Jean-Luc Beuchat
  • Hiroshi Doi
  • Kaoru Fujita
  • Atsuo Inomata
  • Piseth Ith
  • Akira Kanaoka
  • Masayoshi Katouno
  • Masahiro Mambo
  • Eiji Okamoto
  • Takeshi Okamoto
  • Takaaki Shiga
  • Masaaki Shirase
  • Ryuji Soga
  • Tsuyoshi Takagi
  • Ananda Vithanage
  • Hiroyasu Yamamoto
چکیده

Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. As they rely critically on efficient implementations of pairing primitives, the study of hardware accelerators has become an active research area. In this paper, we propose two coprocessors for the reduced ηT pairing introduced by Barreto et al. as an alternative means of computing the Tate pairing on supersingular elliptic curves. We prototyped our architectures on FPGAs. According to our place-and-route results, our coprocessors compare favorably with other solutions described in the open literature. We also present the first ASIC implementation of the reduced ηT pairing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A FPGA pairing implementation using the Residue Number System

Recently, a lot of progresses have been made in software implementations of pairings at the 128-bit security level in large characteristic. In this work, we obtain analogous progresses for hardware implementations. For this, we use the RNS representation of numbers which is especially well suited for pairing computation in a hardware context. A FPGA implementation is proposed, based on an adapt...

متن کامل

Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$

For the first time ever, the FPGA based cryptoprocessor presented in [12] makes it possible to compute an eta pairing at the 128-bit security level in less than one millisecond. The high performance of their cryptoprocessor comes largely from the use of the Karatsuba method for field multiplication. In this article, for the same type of pairing we propose hybrid sequential/parallel multipliers ...

متن کامل

An Algorithm for the ηT Pairing Calculation in Characteristic Three and its Hardware Implementation

In this paper, we propose a modified ηT pairing algorithm in characteristic three which does not need any cube root extraction. We also discuss its implementation on a low cost platform which hosts an Altera Cyclone II FPGA device. Our pairing accelerator is ten times faster than previous known FPGA implementations in characteristic three.

متن کامل

Modular approach for an ASIC integration of electrical drive controls

VLSI circuits design allows today to consider new modes of implementation for electrical controls. However, design techniques require an adaptation effort that few designers, too accustomed to the software approach, provide. The authors of this article propose to develop a methodology to guide the electrical designers towards optimal performances of control algorithms implementation. Thus, they...

متن کامل

Programmable IP core for motion estimation: comparison of FPGA and ASIC based implementations

A performance analysis of two distinct implementations of a recently proposed quite efficient motion estimation coprocessor is presented. This comparison considers two distinct implementation technologies: a high performance FPGA device, from Xilinx Virtex-II Pro family, and an ASIC based implementation, using a 0.18μm CMOS standard cells library. Experimental results have shown that the two co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2008  شماره 

صفحات  -

تاریخ انتشار 2008